Automated Synthesis of Distributed Controllers Anca Muscholl LaBRI, University of Bordeaux Abstract. Synthesis is a particularly challenging problem for concurrent programs. At the same time it is a very promising approa

Source URL: www.labri.fr

Introduction to Algorithms Massachusetts Institute of Technology Professors Erik Demaine, Piotr Indyk, and Manolis Kellis May 19, Spring 2011

Source URL: courses.csail.mit.edu

• Computational complexity theory
• Mathematics
• Theory of computation
• Analysis of algorithms
• Operations research
• Asymptotic analysis
• Combinatorial optimization
• Dynamic programming
• Master theorem
• Big O notation
• Knapsack problem
• Time complexity

On Noise-Tolerant Learning of Sparse Parities and Related Problems Elena Grigorescu? , Lev Reyzin?? , and Santosh Vempala? ? ? School of Computer Science Georgia Institute of Technology 266 Ferst Drive, Atlanta GA 30332

Source URL: www.levreyzin.com

• Analysis of algorithms
• Computational complexity theory
• Time complexity
• Parity problem
• Parity

Adopt-a-Data-Scientist: A Blueprint Prepared by Tim Hwang, Group C, FOCAS 2012, The Aspen Institute | August 7, 2012 The Problem With Data While a great deal of time has been spent in trying to improve the supply of data

Source URL: www.aspeninstitute.org

Chapter 10 Bin Packing Here we consider the classical Bin Packing problem: We are given a set I = {1, . . . , n} of items, where item i ∈ I has size si ∈ (0, 1] and a set B = {1, . . . , n} of bins with capacity one

Source URL: www2.informatik.hu-berlin.de

• Computational complexity theory
• Theory of computation
• Complexity classes
• Packing problems
• NP-complete problems
• Bin packing problem
• Approximation algorithms
• Polynomial-time approximation scheme
• Partition problem
• NP
• NC
• Time complexity

MEDIA STATEMENT: Wheatbelt farmers encouraged to take the time to recover Stress is not the problem, it’s the lack of recovery. This was the key message delivered to Wheatbelt farmers by Mark McKeon, a leading work-lif

Source URL: gga.org.au

Constructive Ramsey theory G´abor Heged˝ us Abstract Explicit construction of Ramsey graphs has remained a challenging open problem for a long time. Frankl–Wilson [8], Alon [1] and Groln

Source URL: iti.mff.cuni.cz

Why Philosophers Should Care About Computational Complexity Scott Aaronson∗ Abstract One might think that, once we know something is computable, how efficiently it can be computed is a practical question with little fu

Source URL: www.scottaaronson.com

• Computational complexity theory
• Theory of computation
• Complexity classes
• Mathematical optimization
• Structural complexity theory
• Models of computation
• P versus NP problem
• NP
• Reduction
• Time complexity
• Oracle machine
• Low

Intro to consensus A simple form of consensus: the “two-generals problem” Two armies want to attack a fortified city. Both armies need to attack at the same time in order to succeed. The armies can only communicate t

Source URL: courses.cs.washington.edu

Wave Packet with a Resonance I just wanted to tell you how one can study the time evolution of the wave packet around the resonance region quite convincingly. This in my mind is the most difficult problem of the homework

Source URL: hitoshi.berkeley.edu